The Complexity of Planarity Testing
نویسندگان
چکیده
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [25]. The upper bound of SL matches the lower bound of L in the context of (nonuniform) circuit complexity, since L/poly is equal to SL/poly. Similarly, we show that a planar embedding, when one exists, can be found in FL. Previously, these problems were known to reside in the complexity class AC , via a O(logn) time CRCW PRAM algorithm [22], although planarity checking for degree-three graphs had been shown to be in SL [23,
منابع مشابه
Testing Cyclic Level and Simultaneous Level Planarity
In this paper we prove that testing the cyclic level planarity of a cyclic level graph is a polynomial-time solvable problem. This is achieved by introducing and studying a generalization of this problem, which we call cyclic T -level planarity. Moreover, we show a complexity dichotomy for testing the simultaneous level planarity of a set of level graphs, with respect to both the number of leve...
متن کاملAdvances on C-Planarity Testing of Extrovert C-Graphs
The problem of testing c-planarity of cgraphs is unknown to be NP-complete or in P. Previous work solved this problem on some special classes of c-graphs. In particular, Goodrich, Lueker, and Sun tested c-planarity of extrovert c-graphs in O(n) time [5]. In this paper, we improve the time complexity of the testing algorithm in [5] to O(n).
متن کاملUpward Spirality and Upward Planarity Testing
The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.
متن کاملA New Parallel Algorithm for Planarity Testing
This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif’s algorithm. The new algorithm has the same complexity bounds as Klein and Reif’s algorithm and runs in O ( n log n p ) time for any number p ≤ n processors o...
متن کاملAdvances in C-Planarity Testing of Clustered Graphs
A clustered graph C = (G; T ) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G = (V;E). Each vertex c in T corresponds to a subset of the vertices of the graph called \cluster". c-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of ...
متن کامل